The 1-D bin packing problem optimisation using bees algorithm

The bin packing problem is a classic combinatorial optimisation that widely used in various applications such as assembly line balancing, scheduling, and time-tabling. Metaheuristic algorithms can provide solutions to these problems faster than exact methods. Bees Algorithm, metaheuristic algorithm inspired by the foraging activity of bees, known for its performance solving problems. To our best knowledge, this first use Algorithm solve problem. In paper, we basic demonstrate near-optimal measure accuracy one-dimensional procedure parameter settings are set following previous research. Benchmark datasets experiment, measured. results indicate research on travelling salesman produce similar results.